Continuous Probabilistic Skyline Queries over Uncertain Data Streams.

A Better Strategy of Discovering Link%2DPattern Based Communities by Classical Clustering Methods.

An Approximation Algorithm for Optimizing Multiple Path Tracking Queries over Sensor Data Streams.

Processing probabilistic spatio%2Dtemporal range queries over moving objects with uncertainty.

A novel hash%2Dbased approach for mining frequent itemsets over data streams requiring less memory space.

Effective database transformation and efficient support computation for mining sequential patterns.

Efficient frequent sequence mining by a dynamic strategy switching algorithm.

Efficient processing of probabilistic spatio%2Dtemporal range queries over moving objects.

A Tree%2DBased Approach for Event Prediction Using Episode Rules over Event Streams.

Mining Serial Episode Rules with Time Lags over Multiple Data Streams.

Mining Serial Episode Rules with Time Lags over Multiple Data Streams.

Efficient and robust sensor data aggregation using linear counting sketches.

Data Analysis.
this article, but Ramsay and Silverman (1997) may be consulted for many more examples and methods, for consideration of the underlying philosophy, and for further references to the literature
Continuous query processing over music streams based on approximate matching mechanisms.


Continuously Matching Episode Rules for Predicting Future Events over Event Streams.


Continuous Evaluation of Fastest Path Queries on Road Networks.

Efficient index and data allocation for wireless broadcast services.

Hiding Sensitive Association Rules with Limited Side Effects.

Maintaining Moving Sums over Data Streams.

Similarity Search in Transaction Databases with a Two%2DLevel Bounding Mechanism.

Approximate Video Search Based on Spatio%2DTemporal Information of Video Objects.

Discovering Frequent Tree Patterns over Data Streams.
Since tree-structured data such as XML files are widely used for data representation and exchange on the Internet, discovering frequent tree patterns over tree-structured data streams becomes an interesting issue. In this paper, we propose an online algorithm to continuously discover the current set of frequent tree patterns from the data stream. A novel and efficient technique is introduced to incrementally generate all candidate tree patterns without duplicates. Moreover, a framework for counting the approximate frequencies of the candidate tree patterns is presented. Combining these techniques, the proposed approach is able to compute frequent tree patterns with guarantees of completeness and accuracy.
Discovering Frequent Tree Patterns over Data Streams.
Since tree-structured data such as XML files are widely used for data representation and exchange on the Internet, discovering frequent tree patterns over tree-structured data streams becomes an interesting issue. In this paper, we propose an online algorithm to continuously discover the current set of frequent tree patterns from the data stream. A novel and efficient technique is introduced to incrementally generate all candidate tree patterns without duplicates. Moreover, a framework for counting the approximate frequencies of the candidate tree patterns is presented. Combining these techniques, the proposed approach is able to compute frequent tree patterns with guarantees of completeness and accuracy.


Similarity%2Dbased Motion Track Management for Video Retrieval.

Effective Database Transformation and Efficient Support Computation for Mining Sequential Patterns.

An Efficient Approach to Extracting Approximate Repeating Patterns in Music Databases.
Abstract. Pattern extraction from music strings is an important problem. The patterns extracted from music strings can be used as features for music retrieval or analysis. Previous works on music pattern extraction only focus on exact repeating patterns. However, music segments with minor differences may sound similar. The concept of the prototypical melody has therefore been proposed to represent these similar music segments. In musicology, the number of music segments that are similar to a prototypical melody implies the importance degree of the prototypical melody to the music work. In this paper, a novel approach is developed to extract all the prototypical melodies in a music work. Our approach considers each music segment as a candidate for the prototypical melody and uses the edit distance to determine the set of music segments that are similar to this candidate. A lower bounding mechanism, which estimates the number of similar music segments for each candidate and prunes the impossible candidates is designed to speed up the process. Experiments are performed on a real data set and the results show a significant improvement of our approach over the existing approaches in the average response time. 1
Mining Frequent Itemsets from Data Streams with a Time%2DSensitive Sliding Window.
Mining frequent itemsets has been widely studied over the last decade. Past research focuses on mining frequent itemsets from static databases. In many of the new applications, data flow through the Internet or sensor networks. It is challenging to extend the mining techniques to such a dynamic environment. The main challenges include a quick response to the continuous request, a compact summary of the data stream, and a mechanism that adapts to the limited resources. In this paper, we develop a novel approach for mining frequent itemsets from data streams based on a time-sensitive sliding window model. Our approach consists of a storage structure that captures all possible frequent itemsets and a table providing approximate counts of the expired data items, whose size can be adjusted by the available storage space. Experiment results show that in our approach both the execution time and the storage space remain small under various parameter settings. In addition, our approach guarantees no false alarm or no false dismissal to the results yielded. 1
An Efficient Algorithm for Near Optimal Data Allocation on Multiple Broadcast Channels.

Data Scheduling in Multiple Channel%2FMultiple Receiver Environments for Processing Data Requests with Timing Constraints.

A Music Recommendation System Based on Music and User Grouping.

Efficient kNN search in polyphonic music databases using a lower bounding mechanism.
Abstract. Querying polyphonic music from a large data collection is an interesting topic. Recently, researchers attempt to provide efficient methods for content-based retrieval in polyphonic music databases where queries are polyphonic. However, most of them do not work well for similarity search, which is important to many applications. In this paper, we propose three polyphonic representations with the associated similarity measures and a novel method to retrieve k music works that contain segments most similar to the query. In general, most of the index-based methods for similarity search generate all the possible answers to the query and then perform exact matching on the index for each possible answer. Based on the edit distance, our method generates only a few possible answers by performing the deletion and/or replacement operations on the query. Each possible answer is then used to perform exact matching on a list-based index, which allows the insertion operations to be performed. For each possible answer, its edit distance to the query is regarded as a lower bound of the edit distances between the matched results and the query. Based on the kNN results that match a possible answer, the possible answers that cannot provide better results are skipped. By using this mechanism, we design a method for efficient kNN search in polyphonic music databases. The experiment results show that our method outperforms the previous works in efficiency. We also evaluate the effectiveness of our method by showing the search results to the musician and non-musician user groups. The experiment results provide useful guidelines on the design of a polyphonic music database.
Constructing a Bowling Information System with Video Content Analysis.

Hiding Sensitive Patterns in Association Rules Mining.

A Novel Representation of Sequence Data Based on Structural Information for Effective Music Retrieval.

Music Classification Using Significant Repeating Patterns.
Abstract. With the popularity of multimedia applications, a large amount of music data has been accumulated on the Internet. Automatic classification of music data becomes a critical technique for providing an efficient and effective retrieval of music data. In this paper, we propose a new approach for classifying music data based on their contents. In this approach, we focus on monophonic music features represented as rhythmic and melodic sequences. Moreover, we use repeating patterns of music data to do music classification. For each pattern discovered from a group of music data, we employ a series of measurements to estimate its usefulness for classifying this group of music data. According to the patterns contained in a music piece, we determine which class it should be assigned to. We perform a series of experiments and the results show that our approach performs on average better than the approach based on the probability distribution of contextual information in music.
An Efficient Algorithm for Mining Frequent Sequences by a New Strategy without Support Counting.
Mining sequential patterns in large databases is an important research topic. The main challenge of mining sequential patterns is the high processing cost due to the large amount of data. In this paper, we propose a new strategy called DIrect Sequence Comparison (abbreviated as DISC), which can find frequent sequences without having to compute the support counts of non-frequent sequences. The main difference between the DISC strategy and the previous works is the way to prune non-frequent sequences. The previous works are based on the anti-monotone property, which prune the non-frequent sequences according to the frequent sequences with shorter lengths. On the contrary, the DISC strategy prunes the non-frequent sequences according to the other sequences with the same length. Moreover, we summarize three strategies used in the previous works and design an efficient algorithm called DISC-all to take advantages of all the four strategies. The experimental results show that the DISC-all algorithm outperforms the PrefixSpan algorithm on mining frequent sequences in large databases. In addition, we analyze these strategies to design the dynamic version of our algorithm, which achieves a much better performance. 1.
Music segmentation by rhythmic features and melodic shapes.

Perceptual analysis for music segmentation.

Video retrieval based on video motion tracks of moving objects.

Constructing a bowling information system with video content analysis.

Efficient K%2DNN search in polyphonic music databases using a lower bounding mechanism.
Abstract. Querying polyphonic music from a large data collection is an interesting topic. Recently, researchers attempt to provide efficient methods for content-based retrieval in polyphonic music databases where queries are polyphonic. However, most of them do not work well for similarity search, which is important to many applications. In this paper, we propose three polyphonic representations with the associated similarity measures and a novel method to retrieve k music works that contain segments most similar to the query. In general, most of the index-based methods for similarity search generate all the possible answers to the query and then perform exact matching on the index for each possible answer. Based on the edit distance, our method generates only a few possible answers by performing the deletion and/or replacement operations on the query. Each possible answer is then used to perform exact matching on a list-based index, which allows the insertion operations to be performed. For each possible answer, its edit distance to the query is regarded as a lower bound of the edit distances between the matched results and the query. Based on the kNN results that match a possible answer, the possible answers that cannot provide better results are skipped. By using this mechanism, we design a method for efficient kNN search in polyphonic music databases. The experiment results show that our method outperforms the previous works in efficiency. We also evaluate the effectiveness of our method by showing the search results to the musician and non-musician user groups. The experiment results provide useful guidelines on the design of a polyphonic music database.
The effectiveness study of various music information retrieval approaches.
In this paper, we describe the Ultima project which aims to construct a platform for evaluating various approaches of music information retrieval. Two kinds of approaches are adopted in this project. These approaches differ in various aspects, such as representations of music objects, index structures, and approximate query processing strategies. For a fair comparison, we propose a measurement of the retrieval effectiveness by recall-precision curves with a scaling factor adjustment. Finally, the performance study of the retrieval effectiveness based on various factors of these approaches is presented. Keywords music database, retrieval methods, retrieval effectiveness, evaluation platform, performance study. 1.
Scheduling Real%2DTime Data Items In Multiple Channels And Multiple Receivers Environments.

A Strategy for Efficient Access of Multiple Data Items in Mobile Environments.

A Semantic Model for Video Description and Retrieval.

A Strategy for Efficient Access of Multiple Data Items in Mobile Environments.

Index and Data Allocation on Multiple Broadcast Channels Considering Data Access Frequencies.
In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, we consider allocating index information and data items on multiple broadcast channels by extending the distributed indexing approach. Moreover, global data replication and local data allocation are performed to improve the average access time of all data items. Simulation is performed to compare the performance of our approach with an existing approach. The result of the experiments shows that our approach outperforms the existing approach.
Data Allocation on Wireless Broadcast Channels for Efficient Query Processing.
Abstract—Data broadcast is an excellent method for efficient data dissemination in the mobile computing environment. The application domain of data broadcast will be widely expanded in the near future, where the client is expected to perform complex queries or transactions on the broadcast data. To reduce the access latency for processing the complex query, it is beneficial to place the data accessed in a query close to each other on the broadcast channel. In this paper, we propose an efficient algorithm to determine the allocation of the data on the broadcast channel such that frequently co-accessed data are not only allocated close to each other, but also in a particular order which optimizes the performance of query processing. Our mechanism is based on the well-known problem named optimal linear ordering. Experiments are performed to justify the benefit of our approach. Index Terms—Database broadcasting, query processing, access time, tuning time, broadcast program. 1
3D%2DList A Data Structure for Efficient Video Query Processing.
In this paper, a video query model based on the content of video and iconic indexing is proposed. We extend the notion of two-dimensional strings to three-dimensional strings (3D-Strings) for representing the spatial and temporal relationships among the symbols in both a video and a video query. The problem of video query processing is then transformed into a problem of three-dimensional pattern matching. To efficiently match the 3D-Strings, a data structure called 3D-List and its related algorithms are proposed. In this approach, the symbols of a video in the video database are retrieved from the video index and organized as a 3D-List according to the 3D-String of the video query. The related algorithms are then applied on the 3D-List to determine whether this video is an answer to the video query. Based on this approach, we have started a project called Vega. In this project, we have implemented a user friendly interface for specifying video queries, a video index tool for constructing the video index, and a video query processor based on the notion of 3D-List. Some experiments are also performed to show the efficiency and effectiveness of the proposed algorithms. 1.
Efficient Query Processing in Integrated Multiple Object Databases with Maybe Result Certification.


Optimizing Queries with Foreign Functions in a Distributed Environment.

A mask matching approach for video segmentation on compressed data.

An Approach to Querying Multiple Object Databases.


A Music Recommendation System Based on Music Data Grouping and User Interests.

A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels.
In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data dissemination. In this paper, the problem for generating a broadcast program of a set of data items with the associated access frequencies on multiple channels is explored. In our approach, an expected average access time of the broadcast data items is first derived. The broadcast program is then generated, which minimizes the expected average access time. Simulation is performed to compare the performance of our approach with two existing approaches. The result of the experiments shows that our approach outperforms others and is in fact close to the optimal.
Processing concept queries with object motions in video databases.

Building a Platform for Performance Study of Various Music Information Retrieval Approaches.

Enabling Personalized Recommendation on the Web based on User Interests and Behaviors.

Motion event derivation and query language for video databases.

Content%2Dbased image retrieval by feature point matching.
With the advance of multimedia technologies and the explosive expansion of the World Wide Web, the volume of image and video data increases rapidly. An efficient and effective multimedia data retrieval technique is needed. In this paper, we propose an approach based on feature points for the content-based image retrieval. The feature points extracted from the multiresolution representation of the query image and database image are first matched to determine the matching pairs. Then, the matching pairs are classified into groups. Finally, two similarity measurements based on different similarity requirements are proposed to compute the similarity degree. We perform a series of experiments to study the characteristics of this approach, and compare with the region-based approach on similar-shot sequence retrieval. The comparison shows the superiority of this approach.
A Graph%2DBased Approach for Discovering Various Types of Association Rules.

Discovering nontrivial repeating patterns in music data.

Efficient Graph%2DBased Algorithms for Discovering and Maintaining Association Rules in Large Databases.
Abstract In this paper, we study the issues of mining and maintaining association rules in a large database of customer transactions. The problem of mining association rules can be mapped into the problems of finding large itemsets which are sets of items bought together in a sufficient number of transactions. We revise a graph-based algorithm to further speed up the process of itemset generation. In addition, we extend our revised algorithm to maintain discovered association rules when incremental or decremental updates are made to the databases. Experimental results show the efficiency of our algorithms. The revised algorithm significantly improves over the original one on mining association rules. The algorithms for maintaining association rules are more efficient than re-running the mining algorithms for the whole updated database and outperform previously proposed algorithms that need multiple passes over the database.
Efficient Near Neighbor Searching Using Multi%2DIndexes for Content%2DBased Multimedia Data Retrieval.

The Design of Location Regions Using User Movement Behaviors in PCS Systems.

Knowledge Discovery and Data Mining

Index Structures of User Profiles for Efficient Web Page Filtering Services.

Optimal Index and Data Allocation in Multiple Broadcast Channels.
The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and facilitate data access for the mobile user. Since the mobile units usually have limited battery capacity, the minimization of the access latency for the broadcast data is an important problem. The indexing and scheduling techniques on the broadcast data should be considered. In this paper we propose a solution to find the optimal index and data allocation, which minimizes the access latency for any number of broadcast channels. We represent all the possible allocations as a tree in which the optimal one is searched, and propose a pruning strategy based on some properties to greatly reduce the search space. Experiments are performed to show the effectiveness of the pruning strategy. Moreover, we propose two heuristics to solve the same problem when the size of the broadcast data is large. 1.
Query by Music Segments An Efficient Approach for Song Retrieval.
Query-by-Humming (QBH) is an increasingly prominent technology that allows users to browse through a song database by singing/humming a part of the song they wish to retrieve. Besides these cases, QBH can also be used to track the performance of a user in applications such as Score Alignment and Real-Time Accompaniment. In this paper we present an online QBH algorithm for audio recordings of singing voice, which uses a multi-similarity measurement approach to pinpoint the location of a query within a musical piece taking into account the pitch contour, phonetic content and RMS energy envelope. Experiments show that our approach can achieve 75.4 % Top-1 accuracy in locating an exact melody from the whole song, and 57.8 % Top-1 accuracy in locating the phrase that contains the exact lyrics – an improvement of 170 % over the basic pitch contour method. Average query duration is 6 seconds while average runtime in MATLAB is 0.8 times the duration of the query. 1.
Music Representation%2C Indexing and Retrieval at NTHU.

Efficient multifeature index structures for music data retrieval.

Efficient image retrieval approaches for different similarity requirements.

An Adaptive Access Method for Broadcast Data under an Error%2DProne Mobile Environment.

Partial Natural Outerjoin %2D An Operation for Interoperability in a Multidatabase Environment.

Database Systems for Advanced Applications

Efficient Theme and Non%2DTrivial Repeating Pattern Discovering in Music Databases.
This paper addresses a few problems related to transferring into the digital domain the information of multimedia documents. Indeed, it is desirable to realize archives easier to access and allowing a more widespread fruition of the contents. In this respect, the problem of automatizing as much as possible the transfer and retrieval operations is crucial. After a brief sketch of the work-in-progress activities being done in cooperation by Computer Scientists and Musicologists, some preliminary results will be presented in the fields of multimedia databases, optical music recognition and preservative transfer of sound documents.  1. Introduction  The transfer into the digital domain of the information  of heterogeneous multimedia documents, such as texts, images and sounds, is intended to achieve two main goals. First of all, it is desirable to realize archives endowed with easier and faster access capabilities, as well as allowing a more widespread fruition of the information contents ...
An Approximate String Matching Algorithm for Content%2DBased Music Data Retrieval.

Semantic Video Model for Content%2DBased Retrieval.

Efficient Repeating Pattern Finding in Music Databases.
In this paper, we propose an approach for the extraction of the repeating patterns in music objects. A repeating pattern is a sequence of notes which appears more than once in a music object. It is one of the most important music features which can be used for both content-based retrieval of music data and music data analysis. We propose a data structure called correlative matrix and its associated algorithms for extracting all repeating patterns in a music object. Experiments are also performed and the results are analyzed to show the efficiency and the effectiveness of our approach.
Efficient Graph%2DBased Algorithm for Discovering and Maintaining Knowledge in Large Databases.

An Efficient Approach for Incremental Association Rule Mining.
Abstract. In this paper, we study the issue of maintaining association rules in a large database of sales transactions. The maintenance of association rules can be mapped into the problem of maintaining large itemsets in the database. Because the mining of association rules is time-consuming, we need an efficient approach to maintain the large itemsets when the database is updated. In this paper, we present efficient approaches to solve the problem. Our approaches store the itemsets that are not large at present but may become large itemsets after updating the database, so that the cost of processing the updated database can be reduced. Moreover, we discuss the cases where the large itemsets can be obtained without scanning the original database. Experimental results show that our algorithms outperform other algorithms, especially when the original database need not be scanned in our algorithms. 1
Efficient Repeating Pattern Finding in Music Databases.
In this paper, we propose an approach for the extraction of the repeating patterns in music objects. A repeating pattern is a sequence of notes which appears more than once in a music object. It is one of the most important music features which can be used for both content-based retrieval of music data and music data analysis. We propose a data structure called correlative matrix and its associated algorithms for extracting all repeating patterns in a music object. Experiments are also performed and the results are analyzed to show the efficiency and the effectiveness of our approach.

Query by Rhythm An Approach for Song Retrieval in Music Databases.

Efficient Refinement of Uncertain Data by Fuzzy Integrity Constraints.

Retrieving Video Data Via Motion Tracks of Content Symbols.
Motion is the major feature that differentiates a video from a still image. In content-based retrieval, the motion track of a symbol object can be used as an index of video databases. Query processing based on such index can be treated as a curve matching problem. Two important criteria for solving the problem are sub-matching and approximate-matching. In this paper, two query processing approaches are proposed. The first approach expands the motion track index to a region and allows a user to query against this region. In the second approach, both the motion track index and the query curve are modeled as a combination of peaks and each peak is coded according to its orientation, angle and temporal information. The curve matching problem is then converted into a string matching problem, which is solved efficiently by a new finite automata based method. The proposed string matching algorithm is also shown to be scalable to the growth of the size of the database. 1.

An Efficient Data Mining Technique for Discovering Interesting Association Rules.
Mining sequential patterns is to discover sequential purchasing behaviors of most customers from a large amount of customer transactions. In this paper, a data mining language is presented. From the data mining language, users can specify the interested items and the criteria of the sequential patterns to be discovered. Also, an efficient data mining technique is proposed to extract the sequential patterns according to the users ` requests. 1 Data mining language The definitions about mining sequential patterns are presented in [1,2]. Our data mining language, which refers to [3], is defined as follows:
Manipulation of Exclusive Disjunctive Data in Relational Databases.

Optimizing Entity Join Queries when Data Transmission Cost Dominates.

Vega A Multimedia Database System Supporting Content%2DBased Retrieval.

Indexing
Computer vision is embracing a new research focus in which the aim is to develop visual skills for robots that allow them to interact with a dynamic, realistic environment. To achieve this aim, new kinds of vision algorithms need to be developed which run in real time and subserve the robot&#039;s goals. Two fundamental goals are determin-ing the location of a known object. Color can be successfully used for both tasks. This article demonstrates that color histograms of multicolored objects provide a robust, efficient cue for index-ing into a large database of models. It shows that color histograms are stable object representations in the presence of occlusion and over change in view, and that they can differentiate among a large number of objects. For solving the identification problem, it introduces a technique called Histogram Intersection, which matches model and im-age histograms and a fast incremental version of Histogram Intersection, which allows real-time indexing into a large database of stored models. For solving the location problem it introduces an algorithm called Histogram Backprojection, which performs this task efficiently in crowded scenes. 1
Query Execution Strategies for Missing Data in Distributed Heterogeneous Object Databases.
The problem of missing data arises in the distributed heterogeneous object databases because of the missing attribute conflict and the existence of null values. A set of algorithms are provided in this paper for query processing when the predicates in global queries involve missing data. For providing more informative answers to the users, the maybe results due to missing data are presented in addition to the certain results. One algorithm is designed based on the centralized approach in which the data are sent to the same site for integration and then processing. On the other hand, for reducing the response time, the localized approaches evaluate the predicates in different component databases in parallel. The proposed algorithms are compared and discussed by the simulation result on the total execution time and response time.  1 Introduction  The rapid development of computer networks in recent years has made data sharing among multiple databases important. In a distributed heterogen...
A Content%2DBased Query Language for Video Databases.
This paper presents a content-based video query language CVQL for video databases. Spatial and temporal relationships of content objects are used for the specification of query predicates. Queries of realism are illustrated to show the power of CVQL. Macro definitions are supported to simplify query specification. Index structures and query processing for CVQL are considered, and a prototype video database system is implemented, which consists of a GUI and a CVQL processor. Users can sketch a query and its corresponding predicate by the GUI, and the query can then be converted to CVQL for processing. 1.
Efficient Shot Change Detection on Compressed Video Data.

Music Databases Indexing Techniques and Implementation.

An Efficient Approach to Discovering Knowledge from Large Databases.

Identifying Object Isomerism in Multidatabase Systems.

A Note on %60%60Incomplete Relational Database Models Based on Intervals%27%27.

Evaluating Aggregate Operations Over Imprecise Data.

Aggregate Functions over Probabilisitic Data.

Implementing the Division Operation on a Database containing Uncertain Data.

A New Relation Partitioning Scheme for Distriibuted Query Optimization.

The Analysis of Relationships in Databases for Rule Derivation.
Owing to the rapid growth in the sizes of databases, potentially useful information may beembeded in a large amount of data. Knowledge discovery is the search for semantic relationships which exist in large databases. One of the main problems for knowledge discovery is that the number of possible relationships can be very large, thus searching for interesting relationships and reducing the search complexity are important. The relationships can be represented as rules which can be used in e cient query processing. We present a technique to analyze relationships among attribute values and to derive compact rule set. We also propose a mechanism and some heuristics to reduce the search complexity for the rule derivation process. An evaluation model is presented to evaluate the quality of the derived rules. Moreover, in real world, databases may contain uncertain data. We also propose a technique to analyze the relationships among uncertain data and derive probabilistic rules.
Proceedings of the Eleventh International Conference on Data Engineering

An Efficient Algorithm for Deriving Compact Rules from Databases.

Parallel Query Processing in Distributed Object Database Systems by Query Packets.

A Mapping Strategy for Querying Multiple Object Databases with a Global Object Schema.

An Exploration of Relationships Among Exclusive Disjunctive Data.

Concept Hierarchies for Database Integration in a Multidatabase System.

Entity Join Optimization in Mutidatabase Systems.

Optimizing Entity Join Queries by Extended Semijoins in a Wide Area Multidatabase Environment.

Database Research at NTHU and ITRI.

Neighborhood%2FConceptual Query Answering with Imprecise%2FIncomplete Data.
The evolution of database systems tends to the development of higher degree of user-friendliness such that the system can be directly handled by nonprofessionals. In order to reach this goal, the database system needs to provide a query language by which queries can be speci ed conceptually. Also, the query condition may be relaxed such that information within a certain semantic distance to the exact answer can be obtained. Moreover, the real-world information is usually imprecise and incomplete. It is therefore important to store imprecise and incomplete information in a database, and to manipulate this information accordingly. In this paper, we provide a conceptual query language by which fuzzy query conditions and neighborhood query conditions can be speci ed. Query processing strategies for these two query conditions are proposed considering imprecise and incomplete information. A domain concept hierarchy is constructed ontopofanumerical domain to handle imprecise data, while dependencies between database attributes are derived for incomplete information. An application of the techniques for processing queries under network partitioning is also discussed. 1
Integration of Heterogeneous Object Schemas.
. In a heterogeneous database system which consists of object  databases, a global schema created by integrating schemas of the  component databases can provide a uniform interface and high level location  transparency for the users to retrieve data. The main problem  for constructing a global schema is to resolve conflicts among component  schemas. In this paper, we define corresponding assertions for the  database administrators to specify the semantic correspondences among  component object schemas. Based on these assertions, integration rules  are designed, which use a set of primitive integration operators to restructure  the component schemas for resolving the conflicts and do the integration.  The principle of our integration strategy is to keep the data of  component databases retrievable from the global schema without losing  information. Moreover, more informative query answers may be derived  from the heterogeneous databases due to schema integration. Finally,  the mapping s...
Querying Uncertain Data in Heterogeneous Databases.

Refining Imprecise Data by Integrity Constraints.

Answering Heterogeneous Database Queries with Degrees of Uncertainty.
As database systems are increasingly being used in advanced applications, it is becoming common that data in these applications contain some elements of uncertainty. These arise from many factors, such as measurement errors and cognitive errors. As such, many researchers have focused on defining comprehensive uncertainty data models of uncertainty database systems. However, existing uncertainty data models do not adequately support some applications. Moreover, very few works address uncertainty tuple calculus. In this paper we advocate a probabilistic data model for representing uncertain information. In particular, we establish a probabilistic tuple calculus language and its semantics to meet the corresponding probabilistic relational algebra. 1.
A Localized Approach to Query Optimization in Heterogeneous Database Systems.

Searching a Minimal Semantically%2DEquivalent Subset of a Set of Partial Values

Generalizing the Division Operation on Indefinite Databases.

A Probabilistic Approach to Query Processing in Heterogeneous Database Systems.

On mapping natural language constructs into relational algebra through E%2DR representation.

A Parallel Execution Method for Minimizing Distributed Query Response Time.

Improving Distributed Query Processing by Hash%2DSemijoins.

Mermaid %2D Experiences with Network Operation.

Distributed Query Optimization by One%2DShot Fixed%2DPrecision Semi%2DJoin Execution.

Optimizing Multidatabase Queries by Query Transformation.

Outer Join Optimization in Multidatabase Systems.

A Localized Approach to Distributed Query Processing.

Partition Strategy for Distributed Query Processing in Fast Local Networks.

Algorithms to Process Distributed Queries in Fast Local Networks.

Mermaid %2D Experiences with Network Operation.

Adaptive Techniques for Distributed Query Optimization.

Partitioning Relation for Parallel Processing in Fast Local Networks.

An Optimal Algorithm for Processing Distributed Star Queries.

Deriving Optimal Semi%2DJoin Programs for Distributed Query Processing.

Optimizing Star Queries in a Distributed Database System.

Improvement Algorithms for Semijoin Query Processing Programs in Distributed Database Systems.

